An Efficient 3D Optical Implementation of Binary de Bruijn Networks with Applications to Massively Parallel Computing
نویسندگان
چکیده
As an alternative t o the hypercube, the binary d e Bruijn BdB network is recently receiving rithmic diameter, fault-tolerance, and simple routing but also requires fewer links than the hypercube for the same network size. Additionally, a major advantage of the BdB network is a constant node degree: the number of edges per node is independent of the network size. This makes it very desirable for large-scale parallel systems. However, due t o its asymmetrical nature and global connectivity at is posing a major challenge for VLSI technology. Optics, owing t o its threedimensional and global connectivity nature seems to be very suitable for implementing BdB networks. In this paper, we present an implementation methodology for optical BdB networks. The distinctive feature of the proposed implementation methodology is partitionability of the network into a f e w primitive operations that can be eficiently implemented. We further show feasibility of the presented design methodology by proposing an optical implementation of the BdB network. much attention. h L he dB not only provides a loga-
منابع مشابه
An E cient 3 D Optical Implementation of Binary de Bruijn Networks with Applications to Massively Parallel Computing 1
The interconnection network structure can be the deciding and limiting factor in cost and performance of parallel computers. One of the most popular point-to-point interconnection networks for parallel computers today is the hypercube. The regularity, logarithmic diameter, symmetry, high connectivity, fault-tolerance, simple routing, and recon gurability (easy embedding of other network topolog...
متن کاملOptical binary de Bruijn networks for massively parallel computing: design methodology and feasibility study.
The interconnection network structure can be the deciding and limiting factor in the cost and the performance of parallel computers. One of the most popular point-to-point interconnection networks for parallel computers today is the hypercube. The regularity, logarithmic diameter, symmetry, high connectivity, fault tolerance, simple routing, and reconfigurability (easy embedding of other networ...
متن کاملSpanning Trees for Binary Directed De Bruijn Networks and Their Applications to Load Balancing
One of the major reasons of using parallel computer systems is that they have the potential for improving performance and resource sharing. To achieve this, an efficient way must be provided to broadcast a message or messages from a node to every other nodes in the system. However, the efficiency of transferring messages in a system is determined by the architecture of the underlying interconne...
متن کاملEfficient implementation of low time complexity and pipelined bit-parallel polynomial basis multiplier over binary finite fields
This paper presents two efficient implementations of fast and pipelined bit-parallel polynomial basis multipliers over GF (2m) by irreducible pentanomials and trinomials. The architecture of the first multiplier is based on a parallel and independent computation of powers of the polynomial variable. In the second structure only even powers of the polynomial variable are used. The par...
متن کاملProducts of Networks with Logarithmic Diameter and Fixed Degree
This paper rst presents some general properties of product networks pertinent to parallel ar-chitectures and then focuses on three case studies. These are products of complete binary trees, shuue-exchange, and de Bruijn networks. It is shown that all of these are powerful architectures for parallel computation, as evidenced by their ability to eeciently emulate numerous other archi-tectures. In...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2004